Logic, Metalogic and Neutrality* (penultimate Version)

نویسنده

  • Timothy Williamson
چکیده

A natural metametaphysical hope is that logic should be able to act as a neutral arbiter of metaphysical disputes, at least as a framework on which all parties can agree for eliciting the consequences of the rival metaphysical theories. An obvious problem for this hope is the proliferation of alternative logics, many of them motivated by metaphysical considerations. For example, rejection of the law of excluded middle has been based on metaphysical conceptions of the future or of infinity. Quantum mechanics has been interpreted as showing the invalidity of one of the distributive laws. Dialetheists believe that paradoxes about sets or change manifest black holes of contradiction in reality itself. There is no core of universally accepted logical principles. Nevertheless, logic seems to have come of age as a mature science. This paper explores some aspects of the situation just sketched. In particular, it assesses the idea that metalogic is the agreed, scientific part of logic. It takes some comments by Georg Henrik von Wright on the past and future of logic as a convenient starting point.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying Class-Relationship Logic in a Metalogic Framework

We introduce a class relationship logic for stating various forms of logical relationships between classes. This logic is intended for ontologies and knowledge bases and combinations thereof. Reasoning and querying is conducted in the Datalog logical language, which serves as an embracing decidable and tractable metalogic.

متن کامل

Factoring an Adequacy Proof (Preliminary Version)

This paper contributes to the methodology of using metalogics for reasoning about programming languages. As a concrete example we consider a fragment of ML corresponding to call-by-value PCF and translate it into a metalogic which contains (amongst other types) computation types and a fixpoint type. The main result is a soundness property (?): if the denotations of two programs are provably equ...

متن کامل

Inductive Metalogic Programming 1

We propose a metalogic programming method for eecient induction of a fairly large class of list-handling logic programs delineated through restrictions on the hypothesis language. These restrictions take the form of predeened program recursion schemes (higher order \clich es") from which the hypotheses programs in the induction process are derived by plugging in either simple, nonrecursive clau...

متن کامل

Mental metalogic and its empirical justifications: The case of reasoning with quantifiers and predicates

We report on a series of experiments designed to test a new, unifying theory in psychology of deductive reasoning: mental metalogic (MML, for short; Yang & Bringsjord, 2001), which marks the unification of mental logic (ML) and mental model (MM) theory, and stands in part on the strength of empirical investigation of strategic interactions between logical syntactic and logical semantic processe...

متن کامل

Flexible Query-Answering Systems Modelled in Metalogic Programming

Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to model and develop new, flexible query-answering systems. A model is shown, extending deductive databases by a classification of the clauses in the database, an integration of nonstandard inference rules, and a notion of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010